本文提出了一个简单而有效的框架蒙版，该框架将新提出的掩盖自distillation纳入对比的语言图像预处理中。掩盖自distillation的核心思想是将表示从完整的图像提取到蒙版图像预测的表示形式。这种合并享有两个重要的好处。首先，掩盖的自我验证目标是本地贴片表示学习，这与视觉对比度的互补，专注于与文本相关的表示。二，掩盖的自我验证也与视觉语言对比符合训练目标的视野对比是一致的。视觉编码器用于功能对齐，因此能够学习本地语义从该语言中获得间接监督。我们提供了专门设计的实验，并进行了全面的分析，以验证这两个好处。从经验上讲，我们表明，当MaskClip应用于各种具有挑战性的下游任务时，可以在线性探测，填充和零拍摄中取得卓越的结果，并在语言编码器的指导下取得了卓越的结果。

神经隐式表示在新的视图合成和来自多视图图像的高质量3D重建方面显示了其有效性。但是，大多数方法都集中在整体场景表示上，但忽略了其中的各个对象，从而限制了潜在的下游应用程序。为了学习对象组合表示形式，一些作品将2D语义图作为训练中的提示，以掌握对象之间的差异。但是他们忽略了对象几何和实例语义信息之间的牢固联系，这导致了单个实例的不准确建模。本文提出了一个新颖的框架ObjectsDF，以在3D重建和对象表示中构建具有高保真度的对象复合神经隐式表示。观察常规音量渲染管道的歧义，我们通过组合单个对象的签名距离函数（SDF）来对场景进行建模，以发挥明确的表面约束。区分不同实例的关键是重新审视单个对象的SDF和语义标签之间的牢固关联。特别是，我们将语义信息转换为对象SDF的函数，并为场景和对象开发统一而紧凑的表示形式。实验结果表明，ObjectSDF框架在表示整体对象组合场景和各个实例方面的优越性。可以在https://qianyiwu.github.io/objectsdf/上找到代码

在本文中，我们介绍了人际内和人际关系网络（I^2R-NET），以进行多人姿势估计。它涉及两个基本模块。首先，人类内部关系模块在一个人身上运行，旨在捕获人类内部依赖性。其次，人际关系模块考虑了多个实例之间的关系，并着重于捕获人间的相互作用。人际关系间的关系模块可以通过减少特征图的分辨率来设计非常轻巧，但学习有用的关系信息以显着提高人类内部关系模块的性能。即使没有铃铛和哨子，我们的方法也可以竞争或胜过当前的比赛获胜者。我们对可可，人群和ochuman数据集进行了广泛的实验。结果表明，所提出的模型超过了所有最新方法。具体而言，所提出的方法在众群数据集上达到了77.4％的AP和Ochuman数据集上的67.8％AP，从而超过了现有方法的大幅度优于较大的利润率。此外，消融研究和可视化分析还证明了我们的模型的有效性。

蒙版的图像建模（MIM）学习具有非常好的微调性能的表示形式，掩盖了先前普遍的预训练方法，例如图像分类，实例对比度学习和图像文本对齐。在本文中，我们表明，通过以功能蒸馏（FD）形式进行简单的后处理，可以显着改善这些预训练方法的下部微调性能。功能蒸馏将旧表示形式转换为具有一些理想属性的新表示形式，就像MIM产生的表示一样。这些属性总共称为优化友好性，通过一组与注意力和优化相关的诊断工具来识别和分析。借助这些属性，新表示表现出强烈的微调性能。具体而言，对比度的自我监督学习方法在微调方面具有竞争力，就像最先进的蒙版图像建模（MIM）算法一样。剪辑模型的微调性能也得到了显着改善，夹子VIT-L模型达到\ TextBf {89.0％} TOP-1的ImagEnet-1K分类精度。在30亿参数SWINV2-G模型上，ADE20K语义分割的微调精度通过+1.5 miou提高到\ textbf {61.4 miou}，创建了新记录。更重要的是，我们的工作为未来的研究提供了一种方法，可以将更多的精力集中在学习表现的通用性和可扩展性上，而不会与优化友好性相处，因为它可以很容易地增强。该代码将在https://github.com/swintransformer/feature-distillation上找到。

如何学习一个促进所有面部分析任务的通用面部表示？本文对此目标进行了一步。在本文中，我们研究了面对面分析任务的预先训练模型的转移性能，并以视语言方式为一般面部代表学习学习的框架，称为Farl。一方面，该框架涉及从图像文本对学习高级语义含义的对比损失。另一方面，我们提出通过添加掩蔽图像建模来同时探索低级信息以进一步增强面部表示。我们对Laion-face进行预训练，一个包含大量面部图像文本对的数据集，并评估在多个下游任务上的表示功能。我们表明Farl与以前的预先训练的模型相比，Farl实现了更好的转移性能。我们还验证了低数据制度的优势。更重要的是，我们的模型在面部分析任务上超越了最先进的方法，包括面部解析和面部对齐。

本文介绍了Simmim，这是一个简单的蒙面图像建模框架。我们在没有特殊设计的情况下简化了最近提出的相关方法，例如通过离散VAE或聚类的块状掩蔽和令牌化。要研究蒙版图像建模任务学习良好的表示，我们系统地研究了我们框架中的主要组成部分，并发现每个组件的简单设计揭示了非常强烈的表示学习性能：1）用中等的输入图像随机掩蔽输入图像大型蒙面贴片尺寸（例如，32）进行了强大的文本前任务; 2）通过直接回归预测RGB值的原始像素不比具有复杂设计的补丁分类方法更差; 3）预测头可以像线性层一样光，性能比较重的形式更差。使用VIT-B，我们的方法通过预训练在此数据集上进行预培训，我们的方法在ImageNet-1K上实现了83.8％的精细调整精度，超过了以前最佳方法+ 0.6％。当应用于大约6.5亿参数的更大模型时，SwinV2-H，它在Imagenet-1K上使用Imagenet-1K数据实现了87.1％的前1个精度。我们还利用这种方法来促进3B模型（SWINV2-G）的培训，比以前的实践中的数据减少40美元，我们在四个代表性视觉基准上实现了最先进的。代码和模型将在https://github.com/microsoft/simmim公开使用。

Masked image modeling (MIM) performs strongly in pre-training large vision Transformers (ViTs). However, small models that are critical for real-world applications cannot or only marginally benefit from this pre-training approach. In this paper, we explore distillation techniques to transfer the success of large MIM-based pre-trained models to smaller ones. We systematically study different options in the distillation framework, including distilling targets, losses, input, network regularization, sequential distillation, etc, revealing that: 1) Distilling token relations is more effective than CLS token- and feature-based distillation; 2) An intermediate layer of the teacher network as target perform better than that using the last layer when the depth of the student mismatches that of the teacher; 3) Weak regularization is preferred; etc. With these findings, we achieve significant fine-tuning accuracy improvements over the scratch MIM pre-training on ImageNet-1K classification, using all the ViT-Tiny, ViT-Small, and ViT-base models, with +4.2%/+2.4%/+1.4% gains, respectively. Our TinyMIM model of base size achieves 52.2 mIoU in AE20K semantic segmentation, which is +4.1 higher than the MAE baseline. Our TinyMIM model of tiny size achieves 79.6% top-1 accuracy on ImageNet-1K image classification, which sets a new record for small vision models of the same size and computation budget. This strong performance suggests an alternative way for developing small vision Transformer models, that is, by exploring better training methods rather than introducing inductive biases into architectures as in most previous works. Code is available at https://github.com/OliverRensu/TinyMIM.

Dataset distillation has emerged as a prominent technique to improve data efficiency when training machine learning models. It encapsulates the knowledge from a large dataset into a smaller synthetic dataset. A model trained on this smaller distilled dataset can attain comparable performance to a model trained on the original training dataset. However, the existing dataset distillation techniques mainly aim at achieving the best trade-off between resource usage efficiency and model utility. The security risks stemming from them have not been explored. This study performs the first backdoor attack against the models trained on the data distilled by dataset distillation models in the image domain. Concretely, we inject triggers into the synthetic data during the distillation procedure rather than during the model training stage, where all previous attacks are performed. We propose two types of backdoor attacks, namely NAIVEATTACK and DOORPING. NAIVEATTACK simply adds triggers to the raw data at the initial distillation phase, while DOORPING iteratively updates the triggers during the entire distillation procedure. We conduct extensive evaluations on multiple datasets, architectures, and dataset distillation techniques. Empirical evaluation shows that NAIVEATTACK achieves decent attack success rate (ASR) scores in some cases, while DOORPING reaches higher ASR scores (close to 1.0) in all cases. Furthermore, we conduct a comprehensive ablation study to analyze the factors that may affect the attack performance. Finally, we evaluate multiple defense mechanisms against our backdoor attacks and show that our attacks can practically circumvent these defense mechanisms.

Benefiting from the intrinsic supervision information exploitation capability, contrastive learning has achieved promising performance in the field of deep graph clustering recently. However, we observe that two drawbacks of the positive and negative sample construction mechanisms limit the performance of existing algorithms from further improvement. 1) The quality of positive samples heavily depends on the carefully designed data augmentations, while inappropriate data augmentations would easily lead to the semantic drift and indiscriminative positive samples. 2) The constructed negative samples are not reliable for ignoring important clustering information. To solve these problems, we propose a Cluster-guided Contrastive deep Graph Clustering network (CCGC) by mining the intrinsic supervision information in the high-confidence clustering results. Specifically, instead of conducting complex node or edge perturbation, we construct two views of the graph by designing special Siamese encoders whose weights are not shared between the sibling sub-networks. Then, guided by the high-confidence clustering information, we carefully select and construct the positive samples from the same high-confidence cluster in two views. Moreover, to construct semantic meaningful negative sample pairs, we regard the centers of different high-confidence clusters as negative samples, thus improving the discriminative capability and reliability of the constructed sample pairs. Lastly, we design an objective function to pull close the samples from the same cluster while pushing away those from other clusters by maximizing and minimizing the cross-view cosine similarity between positive and negative samples. Extensive experimental results on six datasets demonstrate the effectiveness of CCGC compared with the existing state-of-the-art algorithms.

As one of the prevalent methods to achieve automation systems, Imitation Learning (IL) presents a promising performance in a wide range of domains. However, despite the considerable improvement in policy performance, the corresponding research on the explainability of IL models is still limited. Inspired by the recent approaches in explainable artificial intelligence methods, we proposed a model-agnostic explaining framework for IL models called R2RISE. R2RISE aims to explain the overall policy performance with respect to the frames in demonstrations. It iteratively retrains the black-box IL model from the randomized masked demonstrations and uses the conventional evaluation outcome environment returns as the coefficient to build an importance map. We also conducted experiments to investigate three major questions concerning frames' importance equality, the effectiveness of the importance map, and connections between importance maps from different IL models. The result shows that R2RISE successfully distinguishes important frames from the demonstrations.